Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
نویسندگان
چکیده
The coefficient sequences of multivariate rational functions appear in many areas combinatorics. Their diagonal enjoy nice arithmetic and asymptotic properties, the field analytic combinatorics several variables (ACSV) makes it possible to compute expansions. We consider these methods from point view effectivity. In particular, given a function, ACSV requires one determine (generically) finite collection points that are called critical minimal. Criticality is an algebraic condition, meaning well treated by classical computer algebra, while minimality semi-algebraic condition describing on boundary domain convergence power series. show how obtain dominant asymptotics for sequence under some genericity assumptions using symbolic-numeric techniques. To our knowledge, this first completely automatic treatment complexity analysis enumeration arbitrary number variables.
منابع مشابه
Diagonal asymptotics for symmetric rational functions via ACSV
We consider asymptotics of power series coefficients of rational functions of the form 1/Q where Q is a symmetric multilinear polynomial. We review a number of such cases from the literature, chiefly concerned either with positivity of coefficients or diagonal asymptotics. We then analyze coefficient asymptotics using ACSV (Analytic Combinatorics in Several Variables) methods. While ACSV someti...
متن کاملEfficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is the same as the number of unknowns n the best known algorithms are exhaustive search for small fields, and a Gröbner base algorithm for large fields. Gröbner base algorit...
متن کاملNumerical solution of multivariate polynomial systems by homotopy continuation methods
pn(xi,...,xn) = 0 for x = (x\,... ,xn). This problem is very common in many fields of science and engineering, such as formula construction, geometric intersection problems, inverse kinematics, power flow problems with PQ-specified bases, computation of equilibrium states, etc. Elimination theory-based methods, most notably the Buchberger algorithm (Buchberger 1985) for constructing Grobner bas...
متن کاملComparison of Algorithms for Multivariate Rational Approximation
Let F be a continuous real-valued function defined on the unit square [—1,11 x [-1, 1]. When developing the rational product approximation to F, a certain type of discontinuity may arise. We develop a variation of a known technique to overcome this discontinuity so that the approximation can be programmed. Rational product approximations to F have been computed using both the second algorithm o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2021
ISSN: ['1095-855X', '0747-7171']
DOI: https://doi.org/10.1016/j.jsc.2020.01.001